Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs

Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted deleted frequently. Existing work proposes data structures algorithms with worst case guarantees. We propose a new structure, the tree (D-tree), together construct maintain it. The D-tree first structure that scales millions of and, on average, answers much faster than